A Multifractal Analysis for Stern-brocot Intervals, Continued Fractions and Diophantine Growth Rates
نویسنده
چکیده
In this paper we obtain multifractal generalizations of classical results by Lévy and Khintchin in metrical Diophantine approximations and measure theory of continued fractions. We give a complete multifractal analysis for Stern–Brocot intervals, for continued fractions and for certain Diophantine growth rates. In particular, we give detailed discussions of two multifractal spectra closely related to the Farey map and the Gauss map.
منابع مشابه
Proportionally modular diophantine inequalities and the Stern-Brocot tree
Given positive integers a, b and c to compute a generating system for the numerical semigroup whose elements are all positive integer solutions of the inequality axmod b ≤ cx is equivalent to computing a Bézout sequence connecting two reduced fractions. We prove that a proper Bézout sequence is completely determined by its ends and we give an algorithm to compute the unique proper Bézout sequen...
متن کاملFractal Analysis for Sets of Non-differentiability of Minkowski’s Question Mark Function
In this paper we study various fractal geometric aspects in connection with Minkowski’s question mark function Q on the unit interval U . We show that U can be written as the union of the three sets Λ0 := {x : Q′(x) = 0} , Λ∞ := {x : Q′(x) = ∞} , and Λ∼ := {x : Q′(x) does not exist and Q′(x) 6= ∞}. The main result is that the Hausdorff dimensions of these sets are related as follows. dimH(νF) <...
متن کاملExact arithmetic on the Stern-Brocot tree
In this paper we present the Stern–Brocot tree as a basis for performing exact arithmetic on rational numbers. There exists an elegant binary representation for positive rational numbers based on this tree [Graham et al., Concrete Mathematics, 1994]. We will study this representation by investigating various algorithms to perform exact rational arithmetic using an adaptation of the homographic ...
متن کاملA variation of the Stern-Brocot tree
The Stern-Brocot tree (or rather half of it) can be defined as follows. Start with two fractions 0/1 and 1/1, forming an ordered set S0. (Throughout this paper, “fraction” means “fraction in lowest terms”.) At stage k, (k = 1, 2, . . .), form a new set Sk by inserting between each pair of adjacent fractions in Sk−1, say p/q and r/s, the fraction (p+r)/(q+s). Name the (ordered) set of fractions ...
متن کاملChristoffel Words and the Calkin-Wilf Tree
In this note we present some results on the Calkin-Wilf tree of irreducible fractions, giving an insight on the duality relating it to the Stern-Brocot tree, and proving noncommutative versions of known results relating labels of the CalkinWilf trees to hyperbinary expansions of positive integers. The main tool is the Christoffel tree introduced in a paper by Berstel and de Luca.
متن کامل